Pareto Optimal Path Generation Algorithm in Stochastic Transportation Networks
نویسندگان
چکیده
منابع مشابه
A Pareto Optimal D* Search Algorithm for Multiobjective Path Planning
Path planning is one of the most vital elements of mobile robotics, providing the agent with a collision-free route through the workspace. The global path plan can be calculated with a variety of informed search algorithms, most notably the A* search method, guaranteed to deliver a complete and optimal solution that minimizes the path cost. D* is widely used for its dynamic replanning capabilit...
متن کاملfault location in power distribution networks using matching algorithm
چکیده رساله/پایان نامه : تاکنون روشهای متعددی در ارتباط با مکان یابی خطا در شبکه انتقال ارائه شده است. استفاده مستقیم از این روشها در شبکه توزیع به دلایلی همچون وجود انشعابهای متعدد، غیر یکنواختی فیدرها (خطوط کابلی، خطوط هوایی، سطح مقطع متفاوت انشعاب ها و تنه اصلی فیدر)، نامتعادلی (عدم جابجا شدگی خطوط، بارهای تکفاز و سه فاز)، ثابت نبودن بار و اندازه گیری مقادیر ولتاژ و جریان فقط در ابتدای...
Optimal Distributed Generation (DG) Allocation in Distribution Networks using an Improved Ant Colony Optimization (ACO) Algorithm
Abstract: The development of distributed generation (DGs) units in recent years have created challenges in the operation of power grids, especially distribution networks. One of these issues is the optimal allocation (location and capacity) of these units in distribution networks. In this thesis, a method based on the improved ant colony optimization algorithm is presented to solve the problem ...
متن کاملOptimal Transportation Problem by Stochastic Optimal Control
We solve optimal transportation problem using stochastic optimal control theory. Indeed, for a super linear cost at most quadratic at infinity, we prove Kantorovich duality theorem by a zero noise limit (or vanishing viscosity) argument.. We also obtain a characterization of the support of an optimal measure in Monge-Kantorovich minimization problem (MKP) as a graph. Our key tool is a duality r...
متن کاملImplementation of a Routing Algorithm for Stochastic Transportation Networks
There are many decisions to make when trying to find the quickest way from one stop to another in bus system: the intermediate stop to go to next, the bus to board in order to go to this next stop, the bus to take at the next stop, and so on. In a transportation network where all buses run on time, the optimal decisions could be easily calculated by using a modified form of a standard shortest-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.2983047